Crypto for Tiny Objects
نویسنده
چکیده
This work presents the first known implementation of elliptic curve cryptography for sensor networks, motivated by those networks’ need for an efficient, secure mechanism for shared cryptographic keys’ distribution and redistribution among nodes. Through instrumentation of UC Berkeley’s TinyOS, this work demonstrates that secret-key cryptography is already viable on the MICA2 mote. Through analyses of another’s implementation of modular exponentiation and of its own implementation of elliptic curves, this work concludes that public-key infrastructure may also be tractable in 4 kilobytes of primary memory on this 8-bit, 7.3828-MHz device.
منابع مشابه
A Framework to Securing RFID Transmissions by Varying Transmitted Reader's Power
RFID technology has gained tremendous popularity in the recent years. The tiny, inexpensive RFID tags can be easily attached to objects for seamless identification. However, one glaring weakness of RFID tags, especially passive RFID tags is its lack of capability for implementing strong crypto primitives for security purposes. When no or a weak crypto primitive is implemented, the adversary cou...
متن کاملCrypto Currencies and the Blockchain Technology: An Evolutionary Review of Money and the Payment Systems
In this paper we utilize the main findings from the recent literature to set the economic foundation for the existence of money, its modern interpretation as “memory” (Chokerlakota 1998) and how the Blockchain technology has empowered crypto currencies to perform this role in the information age. To locate the issue in a historical perspective and in line with this strand of thought, we consid...
متن کاملDishonest Majority Multi-Party Computation for Binary Circuits
We extend the Tiny-OT two party protocol of Nielsen et al (CRYPTO 2012) to the case of n parties in the dishonest majority setting. This is done by presenting a novel way of transferring pairwise authentications into global authentications. As a by product we obtain a more efficient manner of producing globally authenticated shares, in the random oracle model, which in turn leads to a more effi...
متن کاملRobust Method for E-Maximization and Hierarchical Clustering of Image Classification
We developed a new semi-supervised EM-like algorithm that is given the set of objects present in eachtraining image, but does not know which regions correspond to which objects. We have tested thealgorithm on a dataset of 860 hand-labeled color images using only color and texture features, and theresults show that our EM variant is able to break the symmetry in the initial solution. We compared...
متن کاملA novel vedic divider based crypto-hardware for nanocomputing paradigm: An extended perspective
Restoring and non-restoring divider has become widely applicability in the era of digital computing application due to its computation speed. In this paper, we have proposed the design of divider of different architecture for the computation of Vedic sutra based. The design of divider in the Vedic mode results in high computation throughput due to its replica architecture, where latency is mini...
متن کامل